Title of dissertation: PERFORMANCE ANALYSIS OF ALGEBRAIC SOFT-DECISION DECODING OF REED-SOLOMON CODES
نویسندگان
چکیده
Title of dissertation: PERFORMANCE ANALYSIS OF ALGEBRAIC SOFT-DECISION DECODING OF REED-SOLOMON CODES Andrew Duggan, Masters of Science, 2006 Thesis directed by: Professor Alexander Barg Department of Electrical and Computer Engineering We investigate the decoding region for Algebraic Soft-Decision Decoding (ASD) of Reed-Solomon codes in a discrete, memoryless, additive-noise channel. An expression is derived for the error radius within which the soft-decision decoder produces a list that contains the transmitted codeword. The error radius for ASD is shown to be larger than that of Guruswami-Sudan hard-decision decoding for a subset of low-rate codes. We then present an upper bound for ASD’s probability of error, where an error is defined as the event that the decoder selects an erroneous codeword from its list. This new definition gives a more accurate bound on the probability of error of ASD. We also derive an estimate of the error-correction radius under multivariate interpolation decoding of a recent generalization of Reed-Solomon codes by F. Parvaresh and A. Vardy. PERFORMANCE ANALYSIS OF ALGEBRAIC SOFT-DECISION DECODING OF REED-SOLOMON CODES
منابع مشابه
Algebraic Soft-Decision Decoding of Reed-Solomon Codes Using Bit-level Soft Information
The performance of algebraic soft-decision decoding (ASD) of Reed-Solomon (RS) codes using bit-level soft information is investigated. Optimal multiplicity assignment strategies (MAS) of ASD with infinite cost are first studied over erasure channels and binary symmetric channels (BSC). The corresponding decoding radii are calculated in closed forms and tight bounds on the error probability are ...
متن کاملAlgebraic Soft-Decision Decoding of Reed–Solomon Codes
A polynomial-time soft-decision decoding algorithm for Reed–Solomon codes is developed. This list-decoding algorithm is algebraic in nature and builds upon the interpolation procedure proposed by Guruswami and Sudan for hard-decision decoding. Algebraic soft-decision decoding is achieved by means of converting the probabilistic reliability information into a set of interpolation points, along w...
متن کاملIterative Algebraic Soft Decision Decoding of Reed-Solomon Codes
In this paper, we propose an iterative soft decision decoding scheme for Reed Solomon codes with near maximum likelihood performance. The advantage of this decoding algorithm over previously proposed algorithms is its fast convergence in terms of the number of iterations required. This is achieved by combining two powerful soft decision decoding techniques which were previously regarded in the ...
متن کاملEfficient Interpolation and Factorization in Algebraic Soft-Decision Decoding of Reed-Solomon Codes
Algebraic soft-decision decoding of Reed-Solomon codes delivers promising coding gains over conventional hard-decision decoding. The main computational steps in algebraic soft-decoding (as well as Sudan-type list-decoding) are bivariate interpolation and factorization. We discuss a new computational technique, based upon re-encoding and coordinate transformation, that significantly reduces the ...
متن کاملSoft decoding of algebraic–geometric codes using Koetter-Vardy algorithm
The first soft-decision decoding algorithm for algebraic–geometric codes is presented. This algorithm is developed based on the Koetter-Vardy algorithm, which was proposed for the decoding of Reed-Solomon codes. The interpolation process is modified by redefining the zero condition of a trivariate polynomial and introducing complexity reducing methods. Simulation results show that 0.7 and 1.7 d...
متن کامل